Interpolation theorems for intuitionistic predicate logic
نویسندگان
چکیده
منابع مشابه
Interpolation theorems for intuitionistic predicate logic
Craig interpolation theorem (which holds for intuitionistic logic) implies that the derivability of X,X’-¿Y’ implies existence of an interpolant I in the common language of X and X’-¿Y’ such that both X-¿I and I,X’-¿Y’ are derivable. For classical logic this extends to X,X’-¿Y,Y’, but for intuitionistic logic there are counterexamples. There is a version true for intuitionistic propositional (b...
متن کاملAutomata Theory Approach to Predicate Intuitionistic Logic
Predicate intuitionistic logic is a well established fragment of dependent types. According to the Curry-Howard isomorphism proof construction in the logic corresponds well to synthesis of a program the type of which is a given formula. We present a model of automata that can handle proof construction in full intuitionistic first-order logic. The automata are constructed in such a way that any ...
متن کاملInterpolation in Fragments of Intuitionistic Propositional Logic
Let NNIL (No Nestings of Implication to the Left) be the fragment of IpL (intuitionistic propositional logic) in which the antecedent of any implication is always prime. The following strong interpolation theorem is proved: if IpL }-A+B and A or B is in NNIL, then there is an interpolant I in KNIT The proof consists in constructing I from a proof of A+B in a sequent calculus system by means of ...
متن کاملAN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
In this paper we extend the notion of degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...
متن کاملIntuitionistic Propositional Logic with Only Equivalence Has No Interpolation
We will show in this paper that there is no interpolation theorem for the fragment of pure equivalence in intuitionistic propositional logic. The computer program that was used to calculate the counterexample by computations on a nite Kripke model is brieey sketched.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2001
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(01)00060-4